Approximate Cordic Rotations for Matrix Computations
نویسنده
چکیده
In this paper we give an overview of approximate CORDIC rotations and try to identify when they might be advantageous for various matrix algorithms and signal processing applications. With this respect we analyse the rotation angles occuring during the discussed algorithms. There are various properties of these rotation angles, which imply that approximate CORDIC rotations are advantageous. The algorithms and applications discussed are: EVD and SVD, SVD{updating, linear systems, space/time adaptive ltering, multiresolution analysis, multiuser detection in wireless CDMA systems.
منابع مشابه
Parallel Svd{updating Using Approximate Rotations
In this paper a parallel implementation of the SVD{updating algorithm using approximate rotations is presented. In its original form the SVD{updating algorithm had numerical problems if no reorthogonalization steps were applied. Representing the orthogonal matrix V (right singular vectors) using its parameterization in terms of the rotation angles of n(n?1)=2 plane rotations these reorthogonali...
متن کاملIterative version of the QRD for adaptive RLS filtering
A modiied version of the QR{decomposition (QRD) is presented. It uses approximate Givens rotations instead of exact Givens rotations, i.e., a matrix entry usually annihilated with an exact rotation by an angle is only reduced by using an approximate rotation by an angle ~. The approximation of the rotations is based on the idea of CORDIC. Evaluating a CORDIC{based approximate rotation is to det...
متن کاملAn algorithm and architecture based on orthonormal μ-rotations for computing the symmetric EVD
In this paper an algorithm and architecture for computing the eigenvalue decomposition (EVD) of a symmetric matrix is presented. The EVD is computed using a Jacobi-type method, where the angle of the rotations is approximated by an angle k , corresponding to an orthonormal {rotation. These orthonormal {rotations are based on the idea of CORDIC and share the property that performing the rotation...
متن کاملError Analysis of CORDIC-Based Jacobi Algorithms
The Jacobi algorithm for eigenvalue calculation of symmetric matrices can be performed with a CORDIC algorithm as its basic module. Recently, a simpliied Jacobi algorithm, by employing approximate rotations based on CORDIC rotations, was proposed. It fully exploits the binary data structure and reduces the overall computational cost signiicantly. In this paper an error analysis of the approxima...
متن کاملEfficient implementations of pipelined CORDIC based IIR digital filters using fast orthonormal μ-rotations
CORDIC based IIR digital lters are orthogonal lters whose internal computations consist of orthogonal transformations. These lters possess desirable properties for VLSI implementations such as regularity, local connection, low sensitivity to nite word-length implementation, and elimination of limit cycles. Recently, ne-grain pipelined CORDIC based IIR digital lter architectures which can perfor...
متن کامل